Under consideration for publication in Theory and Practice of Logic Programming 1 Clingo = ASP + Control: Preliminary Report Martin Gebser1,2 , Roland Kaminski2 , Benjamin Kaufmann2 , and Torsten Schaub2 ∗

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Mathematical logic
• Constraint programming
• Logic in computer science
• Programming paradigms
• Satisfiability modulo theories
• Answer set programming
• Stable model semantics
• G-code
• Subroutine
• Analogy
• Algorithm

Location Choice for Shopping and Leisure Activities Implemented in the Activity-based Multi-agent Transport Simulation MATSim Andreas Horni Darren M. Scott Michael Balmer Kay.W. Axhausen

Source URL: www.strc.ch

• Economy
• Academia
• Business
• Systems theory
• Scientific modeling
• Transportation planning
• Algorithm
• Mathematical logic
• Theoretical computer science
• Scientific modelling
• Leisure
• Time

Doctoral College on Logical Methods in Computer Science 10 Funded Positions for Female Doctoral Students In an effort to address gender equality in computer science, TU Wien, TU Graz, and JKU Linz are seeking exceptional

Source URL: logic-cs.at

Contract.Requires(amount > 0.0); Contract.Ensures(Balance == Contract.OldValue(Balance) + amount); Contract.Invariant(Balance > 0.0); Encouraging Effective Contract Specifications

Source URL: homes.cs.washington.edu

• Theoretical computer science
• Formal methods
• Logic in computer science
• Postcondition
• Null

Representing Aggregators in Relational Probabilistic Models David Buchman⇤ Department of Computer Science University of British Columbia Vancouver, BC, Canada

Source URL: www.cs.ubc.ca

• Model theory
• Predicate logic
• Statistical models
• Regression analysis
• Probability theory
• Bayesian network
• Exchangeable random variables
• FO
• Type
• Expected value
• Joint probability distribution
• Quantifier

Compositional Verification of a Baby Virtual Memory Manager Alexander Vaynberg and Zhong Shao Yale University Abstract. A virtual memory manager (VMM) is a part of an operating system

Source URL: flint.cs.yale.edu

• Formal methods
• Logic in computer science
• Models of computation
• Programming language semantics
• Abstraction
• Kernel
• Abstract state machines
• Semantics
• Denotational semantics
• Operational semantics
• Refinement
• Limit

Constraint Answer Set Solving Martin Gebser, Max Ostrowski, and Torsten Schaub? Universit¨at Potsdam, Institut f¨ur Informatik, August-Bebel-Str. 89, DPotsdam Abstract. We present a new approach to integrating C

Source URL: www.cs.uni-potsdam.de

• Theoretical computer science
• Constraint programming
• Declarative programming
• Logic programming
• Mathematics
• Model theory
• Logic in computer science
• NP-complete problems
• Constraint satisfaction problem
• Answer set programming
• Constraint satisfaction
• Satisfiability modulo theories

Degrees of undecidability of in Term Rewriting J¨org Endrullis, Herman Geuvers, Hans Zantema Radboud University Nijmegen, Technical University Eindhoven, Free University Amsterdam, The Netherlands CSL 2009

Source URL: www.cs.ru.nl

• Theoretical computer science
• Mathematics
• Logic
• Mathematical logic
• Formal languages
• Logic in computer science
• Automated theorem proving
• Logic programming
• Rewriting
• Confluence
• Rewrite order
• Substitution

A Theorem Proving Approach to Secure Information Flow in Concurrent Programs (Extended Abstract) Daniel Bruns, Karlsruhe Institute of Technology We present an approach to formally prove secure information flow in multi-t

Source URL: software.imdea.org

• Theoretical computer science
• Logic in computer science
• Formal methods
• Mathematical logic
• KeY
• Formal verification
• Dynamic logic
• Automated theorem proving
• Logic
• Language-based security